Supersaturated Sparse Graphs and Hypergraphs
نویسندگان
چکیده
منابع مشابه
Supersaturated graphs and hypergraphs
We shall consider graphs (hypergraphs) without loops and multiple edges . Let Ybe a family of so called prohibited graphs and ex (n, Y) denote the maximum number of edges (hyperedges) a graph (hypergraph) on n vertices can have without containing subgraphs from Y A graph (hypergraph) will be called supersaturated if it has more edges than ex (n, Y). If G has n vertices and ex (n, Y)=k edges (hy...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملGraphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating minimal perfect hash functions which allow an arbitrary order to be specified for the keys. We show that almost all members of the family are space and time optimal, and we identify the one with mini...
متن کاملCube-Supersaturated Graphs and Related Problems
In this paper we shall consider ordinary graphs, that is, graphs without loops and multiple edges . Given a graph L, ex(n , L) will denote the maximum number of edges a graph G" of order n can have without containing any L . Determining ex(n,L), or at least finding good bounds on it will be called TURÁN TYPE EXTREMAL PROBLEM. Assume that a graph G" has E > ex(n , L) edges. Then it must contain ...
متن کاملColoring Sparse Hypergraphs
Fix k ≥ 3, and let G be a k-uniform hypergraph with maximum degree ∆. Suppose that for each l = 2, . . . , k − 1, every set of l vertices of G is in at most ∆ k−l k−1 /f edges. Then the chromatic number of G is O(( ∆ log f ) 1 k−1 ). This extends results of Frieze and the second author [10] and Bennett and Bohman [2]. A similar result is proved for 3-uniform hypergraphs where every vertex lies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2018
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rny030